RouteSpray: A multiple-copy routing algorithm based on transit routes
نویسندگان
چکیده
Vehicular networks represent a special type of wireless network that has gained the attention of researchers over the past few years. Routing protocols for this type of network must face several challenges, such as high mobility, high speeds and frequent network disconnections. This paper proposes a vehicular routing algorithm called RouteSpray that in addition to using vehicular routes to help make routing decisions, uses controlled spraying to forward multiple copies of messages, thus ensuring better delivery rates without overloading the network. The results of experiments performed in this study indicate that the RouteSpray algorithm delivered 13.46% more messages than other algorithms reported in the literature. In addition, the RouteSpray algorithm kept the buffer occupation 73.38% lower.
منابع مشابه
A Goal Programming Model for Single Vehicle Routing Problem with Multiple Routes
The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...
متن کاملApplication of A Route Expansion Algorithm for Transit Routes Design in Grid Networks
Establishing a network of transit routes with satisfactory demand coverage is one of the main goals of transitagencies in moving towards a sustainable urban development. A primary concern in obtaining such anetwork is reducing operational costs. This paper deals with the problem of minimizing construction costsin a grid transportation network while satisfying a certain level o...
متن کاملA New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملA Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint
In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کامل